Linear complementarity problems solvable by A single linear program
نویسندگان
چکیده
منابع مشابه
A Class of Linear Complementarity Problems Solvable in Polynomial Time
We describe a “condition” number for the linear complementarity problem (LCP), which characterizes the degree of difficulty for its solution when a potential reduction algorithm is used. Consequently, we develop a class of LCPs solvable in polynomial time. The result suggests that the convexity (or positive semidefiniteness) of the LCP may not be the basic issue that separates LCPs solvable and...
متن کاملA class of polynomially solvable linear complementarity problems
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the defining matrix is nondegenerate and for which the n-step property holds. In this paper we consider an extension of the property to the degenerate case by introducing the concept of an extended n-step vector and matrix. It i...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Sign-Solvable Linear Complementarity Problems
This paper presents a connection between qualitative matrix theory and linear complementarity problems (LCPs). An LCP is said to be sign-solvable if the set of the sign patterns of the solutions is uniquely determined by the sign patterns of the given coefficients. We provide a characterization for sign-solvable LCPs such that the coefficient matrix has nonzero diagonals, which can be tested in...
متن کاملUnified approaches for solvable and unsolvable linear complementarity problems
In this paper, general linear complementarity problems(Lf'Ps) are studied via global optimization problems. In particular, unsolvable 'LCPs are reformulated as multicriteria optimization, minimax optimization and quadratic programming problems. The solvability and unsolvability of LCPs are obtained via these reformulations. Furthermore, first-order and second-order global optimaiity conditions ...
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1976
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01580671